A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
A New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA Stochastic Approach to Solving Fuzzy Constraint Satisfaction Problems
Traditionally, constraint satisfaction problems (CSP's) 1] are so deened that \all the constraints are satissed simultaneously." However, this is not always true. Many CSP's in real-life are \soft CSP's," i.e., an assignment of values to the variables is considered to be a solution even if some constraints are violated. Some of the practical CSP's are fuzzy: they are fully satissed by some valu...
متن کاملSolving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty. It allows for universally quantified variables that can model uncertain actions and events, such as the unknown weather for a future party, ...
متن کاملAn algorithm for solving constraint-satisfaction problems
We introduce a new method, called constraint-directed-generate-and-test (CDGT), for solving constraint satisfaction problems (CSPs). Instead of appending a new instantiation of one variable to a partial solution, as in traditional search methods, CDGT joins two sets of partial solutions and then checks against other relevant constraints to obtain a set of higher order partial solutions. CDGT is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.04.004